ON THE COMPLEXITY OF (RESTRICTED) ALCIr
نویسندگان
چکیده
We consider a new description logic ALCIr that extends ALCI with role inclusion axioms of the form R ⊑ QR1 . . . Rm satisfying a certain regularity condition. We prove that concept satisfiability with respect to RBoxes in this logic is ExpTime-hard. We then define a restriction ALCIr− of ALCIr and show that concept satisfiability with respect to RBoxes in ALCIr− is PSpace-complete.
منابع مشابه
On the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملThe Effect of Task Complexity on EFL Learners’ Narrative Writing Task Performance
This study examined the effects of task complexity on written narrative production under different task complexity conditions by EFL learners at different proficiency levels. Task complexity was manipulated along Robinson’s (2001b) proposed task complexity dimension of Here-and-Now (simple) vs. There-and-Then (complex) in. Accordingly, three specific measures of the written narratives were targ...
متن کاملComparison of Ordinary and Restricted Selection Indices on Genetic Gain of Body Weight in Iranian Moghani Sheep
The effect of ordinary and restricted selection indices on body weight at different ages changes in birth weight of Iranian Moghani sheep was studied. Traits in the aggregate genotype were birth weight (BW), body weights at 3 (BW3) and 12 months of age (BW12). Two ordinary selection indices (I1 and I2) and two restricted selection indices (R1 and R2) were constructed. BW and BW3 were included i...
متن کاملOn generalized reduced representations of restricted Lie superalgebras in prime characteristic
Let $mathbb{F}$ be an algebraically closed field of prime characteristic $p>2$ and $(g, [p])$ a finite-dimensional restricted Lie superalgebra over $mathbb{F}$. It is showed that anyfinite-dimensional indecomposable $g$-module is a module for a finite-dimensional quotient of the universal enveloping superalgebra of $g$. These quotient superalgebras are called the generalized reduced enveloping ...
متن کاملSubspace system identification
We give a general overview of the state-of-the-art in subspace system identification methods. We have restricted ourselves to the most important ideas and developments since the methods appeared in the late eighties. First, the basis of linear subspace identification are summarized. Different algorithms one finds in literature (Such as N4SID, MOESP, CVA) are discussed and put into a unifyin...
متن کامل